app'2(app'2(minus, x), 0) -> x
app'2(app'2(minus, app'2(s, x)), app'2(s, y)) -> app'2(app'2(minus, x), y)
app'2(app'2(quot, 0), app'2(s, y)) -> 0
app'2(app'2(quot, app'2(s, x)), app'2(s, y)) -> app'2(s, app'2(app'2(quot, app'2(app'2(minus, x), y)), app'2(s, y)))
app'2(app'2(le, 0), y) -> true
app'2(app'2(le, app'2(s, x)), 0) -> false
app'2(app'2(le, app'2(s, x)), app'2(s, y)) -> app'2(app'2(le, x), y)
app'2(app'2(app, nil), y) -> y
app'2(app'2(app, app'2(app'2(add, n), x)), y) -> app'2(app'2(add, n), app'2(app'2(app, x), y))
app'2(app'2(low, n), nil) -> nil
app'2(app'2(low, n), app'2(app'2(add, m), x)) -> app'2(app'2(app'2(if_low, app'2(app'2(le, m), n)), n), app'2(app'2(add, m), x))
app'2(app'2(app'2(if_low, true), n), app'2(app'2(add, m), x)) -> app'2(app'2(add, m), app'2(app'2(low, n), x))
app'2(app'2(app'2(if_low, false), n), app'2(app'2(add, m), x)) -> app'2(app'2(low, n), x)
app'2(app'2(high, n), nil) -> nil
app'2(app'2(high, n), app'2(app'2(add, m), x)) -> app'2(app'2(app'2(if_high, app'2(app'2(le, m), n)), n), app'2(app'2(add, m), x))
app'2(app'2(app'2(if_high, true), n), app'2(app'2(add, m), x)) -> app'2(app'2(high, n), x)
app'2(app'2(app'2(if_high, false), n), app'2(app'2(add, m), x)) -> app'2(app'2(add, m), app'2(app'2(high, n), x))
app'2(quicksort, nil) -> nil
app'2(quicksort, app'2(app'2(add, n), x)) -> app'2(app'2(app, app'2(quicksort, app'2(app'2(low, n), x))), app'2(app'2(add, n), app'2(quicksort, app'2(app'2(high, n), x))))
↳ QTRS
↳ Non-Overlap Check
app'2(app'2(minus, x), 0) -> x
app'2(app'2(minus, app'2(s, x)), app'2(s, y)) -> app'2(app'2(minus, x), y)
app'2(app'2(quot, 0), app'2(s, y)) -> 0
app'2(app'2(quot, app'2(s, x)), app'2(s, y)) -> app'2(s, app'2(app'2(quot, app'2(app'2(minus, x), y)), app'2(s, y)))
app'2(app'2(le, 0), y) -> true
app'2(app'2(le, app'2(s, x)), 0) -> false
app'2(app'2(le, app'2(s, x)), app'2(s, y)) -> app'2(app'2(le, x), y)
app'2(app'2(app, nil), y) -> y
app'2(app'2(app, app'2(app'2(add, n), x)), y) -> app'2(app'2(add, n), app'2(app'2(app, x), y))
app'2(app'2(low, n), nil) -> nil
app'2(app'2(low, n), app'2(app'2(add, m), x)) -> app'2(app'2(app'2(if_low, app'2(app'2(le, m), n)), n), app'2(app'2(add, m), x))
app'2(app'2(app'2(if_low, true), n), app'2(app'2(add, m), x)) -> app'2(app'2(add, m), app'2(app'2(low, n), x))
app'2(app'2(app'2(if_low, false), n), app'2(app'2(add, m), x)) -> app'2(app'2(low, n), x)
app'2(app'2(high, n), nil) -> nil
app'2(app'2(high, n), app'2(app'2(add, m), x)) -> app'2(app'2(app'2(if_high, app'2(app'2(le, m), n)), n), app'2(app'2(add, m), x))
app'2(app'2(app'2(if_high, true), n), app'2(app'2(add, m), x)) -> app'2(app'2(high, n), x)
app'2(app'2(app'2(if_high, false), n), app'2(app'2(add, m), x)) -> app'2(app'2(add, m), app'2(app'2(high, n), x))
app'2(quicksort, nil) -> nil
app'2(quicksort, app'2(app'2(add, n), x)) -> app'2(app'2(app, app'2(quicksort, app'2(app'2(low, n), x))), app'2(app'2(add, n), app'2(quicksort, app'2(app'2(high, n), x))))
↳ QTRS
↳ Non-Overlap Check
↳ QTRS
↳ DependencyPairsProof
app'2(app'2(minus, x), 0) -> x
app'2(app'2(minus, app'2(s, x)), app'2(s, y)) -> app'2(app'2(minus, x), y)
app'2(app'2(quot, 0), app'2(s, y)) -> 0
app'2(app'2(quot, app'2(s, x)), app'2(s, y)) -> app'2(s, app'2(app'2(quot, app'2(app'2(minus, x), y)), app'2(s, y)))
app'2(app'2(le, 0), y) -> true
app'2(app'2(le, app'2(s, x)), 0) -> false
app'2(app'2(le, app'2(s, x)), app'2(s, y)) -> app'2(app'2(le, x), y)
app'2(app'2(app, nil), y) -> y
app'2(app'2(app, app'2(app'2(add, n), x)), y) -> app'2(app'2(add, n), app'2(app'2(app, x), y))
app'2(app'2(low, n), nil) -> nil
app'2(app'2(low, n), app'2(app'2(add, m), x)) -> app'2(app'2(app'2(if_low, app'2(app'2(le, m), n)), n), app'2(app'2(add, m), x))
app'2(app'2(app'2(if_low, true), n), app'2(app'2(add, m), x)) -> app'2(app'2(add, m), app'2(app'2(low, n), x))
app'2(app'2(app'2(if_low, false), n), app'2(app'2(add, m), x)) -> app'2(app'2(low, n), x)
app'2(app'2(high, n), nil) -> nil
app'2(app'2(high, n), app'2(app'2(add, m), x)) -> app'2(app'2(app'2(if_high, app'2(app'2(le, m), n)), n), app'2(app'2(add, m), x))
app'2(app'2(app'2(if_high, true), n), app'2(app'2(add, m), x)) -> app'2(app'2(high, n), x)
app'2(app'2(app'2(if_high, false), n), app'2(app'2(add, m), x)) -> app'2(app'2(add, m), app'2(app'2(high, n), x))
app'2(quicksort, nil) -> nil
app'2(quicksort, app'2(app'2(add, n), x)) -> app'2(app'2(app, app'2(quicksort, app'2(app'2(low, n), x))), app'2(app'2(add, n), app'2(quicksort, app'2(app'2(high, n), x))))
app'2(app'2(minus, x0), 0)
app'2(app'2(minus, app'2(s, x0)), app'2(s, x1))
app'2(app'2(quot, 0), app'2(s, x0))
app'2(app'2(quot, app'2(s, x0)), app'2(s, x1))
app'2(app'2(le, 0), x0)
app'2(app'2(le, app'2(s, x0)), 0)
app'2(app'2(le, app'2(s, x0)), app'2(s, x1))
app'2(app'2(app, nil), x0)
app'2(app'2(app, app'2(app'2(add, x0), x1)), x2)
app'2(app'2(low, x0), nil)
app'2(app'2(low, x0), app'2(app'2(add, x1), x2))
app'2(app'2(app'2(if_low, true), x0), app'2(app'2(add, x1), x2))
app'2(app'2(app'2(if_low, false), x0), app'2(app'2(add, x1), x2))
app'2(app'2(high, x0), nil)
app'2(app'2(high, x0), app'2(app'2(add, x1), x2))
app'2(app'2(app'2(if_high, true), x0), app'2(app'2(add, x1), x2))
app'2(app'2(app'2(if_high, false), x0), app'2(app'2(add, x1), x2))
app'2(quicksort, nil)
app'2(quicksort, app'2(app'2(add, x0), x1))
APP'2(app'2(minus, app'2(s, x)), app'2(s, y)) -> APP'2(app'2(minus, x), y)
APP'2(quicksort, app'2(app'2(add, n), x)) -> APP'2(quicksort, app'2(app'2(high, n), x))
APP'2(app'2(app'2(if_low, true), n), app'2(app'2(add, m), x)) -> APP'2(low, n)
APP'2(app'2(app'2(if_low, true), n), app'2(app'2(add, m), x)) -> APP'2(app'2(add, m), app'2(app'2(low, n), x))
APP'2(app'2(quot, app'2(s, x)), app'2(s, y)) -> APP'2(quot, app'2(app'2(minus, x), y))
APP'2(app'2(low, n), app'2(app'2(add, m), x)) -> APP'2(app'2(le, m), n)
APP'2(app'2(low, n), app'2(app'2(add, m), x)) -> APP'2(if_low, app'2(app'2(le, m), n))
APP'2(app'2(app'2(if_high, false), n), app'2(app'2(add, m), x)) -> APP'2(app'2(add, m), app'2(app'2(high, n), x))
APP'2(app'2(app'2(if_high, true), n), app'2(app'2(add, m), x)) -> APP'2(high, n)
APP'2(app'2(high, n), app'2(app'2(add, m), x)) -> APP'2(le, m)
APP'2(app'2(quot, app'2(s, x)), app'2(s, y)) -> APP'2(minus, x)
APP'2(app'2(app'2(if_low, true), n), app'2(app'2(add, m), x)) -> APP'2(app'2(low, n), x)
APP'2(quicksort, app'2(app'2(add, n), x)) -> APP'2(app'2(high, n), x)
APP'2(app'2(app'2(if_low, false), n), app'2(app'2(add, m), x)) -> APP'2(app'2(low, n), x)
APP'2(app'2(app'2(if_low, false), n), app'2(app'2(add, m), x)) -> APP'2(low, n)
APP'2(app'2(quot, app'2(s, x)), app'2(s, y)) -> APP'2(s, app'2(app'2(quot, app'2(app'2(minus, x), y)), app'2(s, y)))
APP'2(app'2(high, n), app'2(app'2(add, m), x)) -> APP'2(app'2(app'2(if_high, app'2(app'2(le, m), n)), n), app'2(app'2(add, m), x))
APP'2(quicksort, app'2(app'2(add, n), x)) -> APP'2(quicksort, app'2(app'2(low, n), x))
APP'2(app'2(app'2(if_high, false), n), app'2(app'2(add, m), x)) -> APP'2(high, n)
APP'2(app'2(low, n), app'2(app'2(add, m), x)) -> APP'2(app'2(app'2(if_low, app'2(app'2(le, m), n)), n), app'2(app'2(add, m), x))
APP'2(quicksort, app'2(app'2(add, n), x)) -> APP'2(high, n)
APP'2(app'2(app, app'2(app'2(add, n), x)), y) -> APP'2(app'2(app, x), y)
APP'2(app'2(minus, app'2(s, x)), app'2(s, y)) -> APP'2(minus, x)
APP'2(quicksort, app'2(app'2(add, n), x)) -> APP'2(app'2(add, n), app'2(quicksort, app'2(app'2(high, n), x)))
APP'2(quicksort, app'2(app'2(add, n), x)) -> APP'2(app'2(low, n), x)
APP'2(app'2(quot, app'2(s, x)), app'2(s, y)) -> APP'2(app'2(minus, x), y)
APP'2(app'2(low, n), app'2(app'2(add, m), x)) -> APP'2(le, m)
APP'2(app'2(high, n), app'2(app'2(add, m), x)) -> APP'2(app'2(if_high, app'2(app'2(le, m), n)), n)
APP'2(app'2(high, n), app'2(app'2(add, m), x)) -> APP'2(if_high, app'2(app'2(le, m), n))
APP'2(app'2(quot, app'2(s, x)), app'2(s, y)) -> APP'2(app'2(quot, app'2(app'2(minus, x), y)), app'2(s, y))
APP'2(app'2(low, n), app'2(app'2(add, m), x)) -> APP'2(app'2(if_low, app'2(app'2(le, m), n)), n)
APP'2(app'2(app, app'2(app'2(add, n), x)), y) -> APP'2(app, x)
APP'2(quicksort, app'2(app'2(add, n), x)) -> APP'2(app'2(app, app'2(quicksort, app'2(app'2(low, n), x))), app'2(app'2(add, n), app'2(quicksort, app'2(app'2(high, n), x))))
APP'2(quicksort, app'2(app'2(add, n), x)) -> APP'2(app, app'2(quicksort, app'2(app'2(low, n), x)))
APP'2(app'2(app'2(if_high, false), n), app'2(app'2(add, m), x)) -> APP'2(app'2(high, n), x)
APP'2(app'2(app'2(if_high, true), n), app'2(app'2(add, m), x)) -> APP'2(app'2(high, n), x)
APP'2(app'2(le, app'2(s, x)), app'2(s, y)) -> APP'2(app'2(le, x), y)
APP'2(quicksort, app'2(app'2(add, n), x)) -> APP'2(low, n)
APP'2(app'2(app, app'2(app'2(add, n), x)), y) -> APP'2(app'2(add, n), app'2(app'2(app, x), y))
APP'2(app'2(high, n), app'2(app'2(add, m), x)) -> APP'2(app'2(le, m), n)
APP'2(app'2(le, app'2(s, x)), app'2(s, y)) -> APP'2(le, x)
app'2(app'2(minus, x), 0) -> x
app'2(app'2(minus, app'2(s, x)), app'2(s, y)) -> app'2(app'2(minus, x), y)
app'2(app'2(quot, 0), app'2(s, y)) -> 0
app'2(app'2(quot, app'2(s, x)), app'2(s, y)) -> app'2(s, app'2(app'2(quot, app'2(app'2(minus, x), y)), app'2(s, y)))
app'2(app'2(le, 0), y) -> true
app'2(app'2(le, app'2(s, x)), 0) -> false
app'2(app'2(le, app'2(s, x)), app'2(s, y)) -> app'2(app'2(le, x), y)
app'2(app'2(app, nil), y) -> y
app'2(app'2(app, app'2(app'2(add, n), x)), y) -> app'2(app'2(add, n), app'2(app'2(app, x), y))
app'2(app'2(low, n), nil) -> nil
app'2(app'2(low, n), app'2(app'2(add, m), x)) -> app'2(app'2(app'2(if_low, app'2(app'2(le, m), n)), n), app'2(app'2(add, m), x))
app'2(app'2(app'2(if_low, true), n), app'2(app'2(add, m), x)) -> app'2(app'2(add, m), app'2(app'2(low, n), x))
app'2(app'2(app'2(if_low, false), n), app'2(app'2(add, m), x)) -> app'2(app'2(low, n), x)
app'2(app'2(high, n), nil) -> nil
app'2(app'2(high, n), app'2(app'2(add, m), x)) -> app'2(app'2(app'2(if_high, app'2(app'2(le, m), n)), n), app'2(app'2(add, m), x))
app'2(app'2(app'2(if_high, true), n), app'2(app'2(add, m), x)) -> app'2(app'2(high, n), x)
app'2(app'2(app'2(if_high, false), n), app'2(app'2(add, m), x)) -> app'2(app'2(add, m), app'2(app'2(high, n), x))
app'2(quicksort, nil) -> nil
app'2(quicksort, app'2(app'2(add, n), x)) -> app'2(app'2(app, app'2(quicksort, app'2(app'2(low, n), x))), app'2(app'2(add, n), app'2(quicksort, app'2(app'2(high, n), x))))
app'2(app'2(minus, x0), 0)
app'2(app'2(minus, app'2(s, x0)), app'2(s, x1))
app'2(app'2(quot, 0), app'2(s, x0))
app'2(app'2(quot, app'2(s, x0)), app'2(s, x1))
app'2(app'2(le, 0), x0)
app'2(app'2(le, app'2(s, x0)), 0)
app'2(app'2(le, app'2(s, x0)), app'2(s, x1))
app'2(app'2(app, nil), x0)
app'2(app'2(app, app'2(app'2(add, x0), x1)), x2)
app'2(app'2(low, x0), nil)
app'2(app'2(low, x0), app'2(app'2(add, x1), x2))
app'2(app'2(app'2(if_low, true), x0), app'2(app'2(add, x1), x2))
app'2(app'2(app'2(if_low, false), x0), app'2(app'2(add, x1), x2))
app'2(app'2(high, x0), nil)
app'2(app'2(high, x0), app'2(app'2(add, x1), x2))
app'2(app'2(app'2(if_high, true), x0), app'2(app'2(add, x1), x2))
app'2(app'2(app'2(if_high, false), x0), app'2(app'2(add, x1), x2))
app'2(quicksort, nil)
app'2(quicksort, app'2(app'2(add, x0), x1))
↳ QTRS
↳ Non-Overlap Check
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
APP'2(app'2(minus, app'2(s, x)), app'2(s, y)) -> APP'2(app'2(minus, x), y)
APP'2(quicksort, app'2(app'2(add, n), x)) -> APP'2(quicksort, app'2(app'2(high, n), x))
APP'2(app'2(app'2(if_low, true), n), app'2(app'2(add, m), x)) -> APP'2(low, n)
APP'2(app'2(app'2(if_low, true), n), app'2(app'2(add, m), x)) -> APP'2(app'2(add, m), app'2(app'2(low, n), x))
APP'2(app'2(quot, app'2(s, x)), app'2(s, y)) -> APP'2(quot, app'2(app'2(minus, x), y))
APP'2(app'2(low, n), app'2(app'2(add, m), x)) -> APP'2(app'2(le, m), n)
APP'2(app'2(low, n), app'2(app'2(add, m), x)) -> APP'2(if_low, app'2(app'2(le, m), n))
APP'2(app'2(app'2(if_high, false), n), app'2(app'2(add, m), x)) -> APP'2(app'2(add, m), app'2(app'2(high, n), x))
APP'2(app'2(app'2(if_high, true), n), app'2(app'2(add, m), x)) -> APP'2(high, n)
APP'2(app'2(high, n), app'2(app'2(add, m), x)) -> APP'2(le, m)
APP'2(app'2(quot, app'2(s, x)), app'2(s, y)) -> APP'2(minus, x)
APP'2(app'2(app'2(if_low, true), n), app'2(app'2(add, m), x)) -> APP'2(app'2(low, n), x)
APP'2(quicksort, app'2(app'2(add, n), x)) -> APP'2(app'2(high, n), x)
APP'2(app'2(app'2(if_low, false), n), app'2(app'2(add, m), x)) -> APP'2(app'2(low, n), x)
APP'2(app'2(app'2(if_low, false), n), app'2(app'2(add, m), x)) -> APP'2(low, n)
APP'2(app'2(quot, app'2(s, x)), app'2(s, y)) -> APP'2(s, app'2(app'2(quot, app'2(app'2(minus, x), y)), app'2(s, y)))
APP'2(app'2(high, n), app'2(app'2(add, m), x)) -> APP'2(app'2(app'2(if_high, app'2(app'2(le, m), n)), n), app'2(app'2(add, m), x))
APP'2(quicksort, app'2(app'2(add, n), x)) -> APP'2(quicksort, app'2(app'2(low, n), x))
APP'2(app'2(app'2(if_high, false), n), app'2(app'2(add, m), x)) -> APP'2(high, n)
APP'2(app'2(low, n), app'2(app'2(add, m), x)) -> APP'2(app'2(app'2(if_low, app'2(app'2(le, m), n)), n), app'2(app'2(add, m), x))
APP'2(quicksort, app'2(app'2(add, n), x)) -> APP'2(high, n)
APP'2(app'2(app, app'2(app'2(add, n), x)), y) -> APP'2(app'2(app, x), y)
APP'2(app'2(minus, app'2(s, x)), app'2(s, y)) -> APP'2(minus, x)
APP'2(quicksort, app'2(app'2(add, n), x)) -> APP'2(app'2(add, n), app'2(quicksort, app'2(app'2(high, n), x)))
APP'2(quicksort, app'2(app'2(add, n), x)) -> APP'2(app'2(low, n), x)
APP'2(app'2(quot, app'2(s, x)), app'2(s, y)) -> APP'2(app'2(minus, x), y)
APP'2(app'2(low, n), app'2(app'2(add, m), x)) -> APP'2(le, m)
APP'2(app'2(high, n), app'2(app'2(add, m), x)) -> APP'2(app'2(if_high, app'2(app'2(le, m), n)), n)
APP'2(app'2(high, n), app'2(app'2(add, m), x)) -> APP'2(if_high, app'2(app'2(le, m), n))
APP'2(app'2(quot, app'2(s, x)), app'2(s, y)) -> APP'2(app'2(quot, app'2(app'2(minus, x), y)), app'2(s, y))
APP'2(app'2(low, n), app'2(app'2(add, m), x)) -> APP'2(app'2(if_low, app'2(app'2(le, m), n)), n)
APP'2(app'2(app, app'2(app'2(add, n), x)), y) -> APP'2(app, x)
APP'2(quicksort, app'2(app'2(add, n), x)) -> APP'2(app'2(app, app'2(quicksort, app'2(app'2(low, n), x))), app'2(app'2(add, n), app'2(quicksort, app'2(app'2(high, n), x))))
APP'2(quicksort, app'2(app'2(add, n), x)) -> APP'2(app, app'2(quicksort, app'2(app'2(low, n), x)))
APP'2(app'2(app'2(if_high, false), n), app'2(app'2(add, m), x)) -> APP'2(app'2(high, n), x)
APP'2(app'2(app'2(if_high, true), n), app'2(app'2(add, m), x)) -> APP'2(app'2(high, n), x)
APP'2(app'2(le, app'2(s, x)), app'2(s, y)) -> APP'2(app'2(le, x), y)
APP'2(quicksort, app'2(app'2(add, n), x)) -> APP'2(low, n)
APP'2(app'2(app, app'2(app'2(add, n), x)), y) -> APP'2(app'2(add, n), app'2(app'2(app, x), y))
APP'2(app'2(high, n), app'2(app'2(add, m), x)) -> APP'2(app'2(le, m), n)
APP'2(app'2(le, app'2(s, x)), app'2(s, y)) -> APP'2(le, x)
app'2(app'2(minus, x), 0) -> x
app'2(app'2(minus, app'2(s, x)), app'2(s, y)) -> app'2(app'2(minus, x), y)
app'2(app'2(quot, 0), app'2(s, y)) -> 0
app'2(app'2(quot, app'2(s, x)), app'2(s, y)) -> app'2(s, app'2(app'2(quot, app'2(app'2(minus, x), y)), app'2(s, y)))
app'2(app'2(le, 0), y) -> true
app'2(app'2(le, app'2(s, x)), 0) -> false
app'2(app'2(le, app'2(s, x)), app'2(s, y)) -> app'2(app'2(le, x), y)
app'2(app'2(app, nil), y) -> y
app'2(app'2(app, app'2(app'2(add, n), x)), y) -> app'2(app'2(add, n), app'2(app'2(app, x), y))
app'2(app'2(low, n), nil) -> nil
app'2(app'2(low, n), app'2(app'2(add, m), x)) -> app'2(app'2(app'2(if_low, app'2(app'2(le, m), n)), n), app'2(app'2(add, m), x))
app'2(app'2(app'2(if_low, true), n), app'2(app'2(add, m), x)) -> app'2(app'2(add, m), app'2(app'2(low, n), x))
app'2(app'2(app'2(if_low, false), n), app'2(app'2(add, m), x)) -> app'2(app'2(low, n), x)
app'2(app'2(high, n), nil) -> nil
app'2(app'2(high, n), app'2(app'2(add, m), x)) -> app'2(app'2(app'2(if_high, app'2(app'2(le, m), n)), n), app'2(app'2(add, m), x))
app'2(app'2(app'2(if_high, true), n), app'2(app'2(add, m), x)) -> app'2(app'2(high, n), x)
app'2(app'2(app'2(if_high, false), n), app'2(app'2(add, m), x)) -> app'2(app'2(add, m), app'2(app'2(high, n), x))
app'2(quicksort, nil) -> nil
app'2(quicksort, app'2(app'2(add, n), x)) -> app'2(app'2(app, app'2(quicksort, app'2(app'2(low, n), x))), app'2(app'2(add, n), app'2(quicksort, app'2(app'2(high, n), x))))
app'2(app'2(minus, x0), 0)
app'2(app'2(minus, app'2(s, x0)), app'2(s, x1))
app'2(app'2(quot, 0), app'2(s, x0))
app'2(app'2(quot, app'2(s, x0)), app'2(s, x1))
app'2(app'2(le, 0), x0)
app'2(app'2(le, app'2(s, x0)), 0)
app'2(app'2(le, app'2(s, x0)), app'2(s, x1))
app'2(app'2(app, nil), x0)
app'2(app'2(app, app'2(app'2(add, x0), x1)), x2)
app'2(app'2(low, x0), nil)
app'2(app'2(low, x0), app'2(app'2(add, x1), x2))
app'2(app'2(app'2(if_low, true), x0), app'2(app'2(add, x1), x2))
app'2(app'2(app'2(if_low, false), x0), app'2(app'2(add, x1), x2))
app'2(app'2(high, x0), nil)
app'2(app'2(high, x0), app'2(app'2(add, x1), x2))
app'2(app'2(app'2(if_high, true), x0), app'2(app'2(add, x1), x2))
app'2(app'2(app'2(if_high, false), x0), app'2(app'2(add, x1), x2))
app'2(quicksort, nil)
app'2(quicksort, app'2(app'2(add, x0), x1))
↳ QTRS
↳ Non-Overlap Check
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDPOrderProof
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
APP'2(app'2(app, app'2(app'2(add, n), x)), y) -> APP'2(app'2(app, x), y)
app'2(app'2(minus, x), 0) -> x
app'2(app'2(minus, app'2(s, x)), app'2(s, y)) -> app'2(app'2(minus, x), y)
app'2(app'2(quot, 0), app'2(s, y)) -> 0
app'2(app'2(quot, app'2(s, x)), app'2(s, y)) -> app'2(s, app'2(app'2(quot, app'2(app'2(minus, x), y)), app'2(s, y)))
app'2(app'2(le, 0), y) -> true
app'2(app'2(le, app'2(s, x)), 0) -> false
app'2(app'2(le, app'2(s, x)), app'2(s, y)) -> app'2(app'2(le, x), y)
app'2(app'2(app, nil), y) -> y
app'2(app'2(app, app'2(app'2(add, n), x)), y) -> app'2(app'2(add, n), app'2(app'2(app, x), y))
app'2(app'2(low, n), nil) -> nil
app'2(app'2(low, n), app'2(app'2(add, m), x)) -> app'2(app'2(app'2(if_low, app'2(app'2(le, m), n)), n), app'2(app'2(add, m), x))
app'2(app'2(app'2(if_low, true), n), app'2(app'2(add, m), x)) -> app'2(app'2(add, m), app'2(app'2(low, n), x))
app'2(app'2(app'2(if_low, false), n), app'2(app'2(add, m), x)) -> app'2(app'2(low, n), x)
app'2(app'2(high, n), nil) -> nil
app'2(app'2(high, n), app'2(app'2(add, m), x)) -> app'2(app'2(app'2(if_high, app'2(app'2(le, m), n)), n), app'2(app'2(add, m), x))
app'2(app'2(app'2(if_high, true), n), app'2(app'2(add, m), x)) -> app'2(app'2(high, n), x)
app'2(app'2(app'2(if_high, false), n), app'2(app'2(add, m), x)) -> app'2(app'2(add, m), app'2(app'2(high, n), x))
app'2(quicksort, nil) -> nil
app'2(quicksort, app'2(app'2(add, n), x)) -> app'2(app'2(app, app'2(quicksort, app'2(app'2(low, n), x))), app'2(app'2(add, n), app'2(quicksort, app'2(app'2(high, n), x))))
app'2(app'2(minus, x0), 0)
app'2(app'2(minus, app'2(s, x0)), app'2(s, x1))
app'2(app'2(quot, 0), app'2(s, x0))
app'2(app'2(quot, app'2(s, x0)), app'2(s, x1))
app'2(app'2(le, 0), x0)
app'2(app'2(le, app'2(s, x0)), 0)
app'2(app'2(le, app'2(s, x0)), app'2(s, x1))
app'2(app'2(app, nil), x0)
app'2(app'2(app, app'2(app'2(add, x0), x1)), x2)
app'2(app'2(low, x0), nil)
app'2(app'2(low, x0), app'2(app'2(add, x1), x2))
app'2(app'2(app'2(if_low, true), x0), app'2(app'2(add, x1), x2))
app'2(app'2(app'2(if_low, false), x0), app'2(app'2(add, x1), x2))
app'2(app'2(high, x0), nil)
app'2(app'2(high, x0), app'2(app'2(add, x1), x2))
app'2(app'2(app'2(if_high, true), x0), app'2(app'2(add, x1), x2))
app'2(app'2(app'2(if_high, false), x0), app'2(app'2(add, x1), x2))
app'2(quicksort, nil)
app'2(quicksort, app'2(app'2(add, x0), x1))
The following pairs can be strictly oriented and are deleted.
The remaining pairs can at least by weakly be oriented.
APP'2(app'2(app, app'2(app'2(add, n), x)), y) -> APP'2(app'2(app, x), y)
trivial
↳ QTRS
↳ Non-Overlap Check
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDPOrderProof
↳ QDP
↳ PisEmptyProof
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
app'2(app'2(minus, x), 0) -> x
app'2(app'2(minus, app'2(s, x)), app'2(s, y)) -> app'2(app'2(minus, x), y)
app'2(app'2(quot, 0), app'2(s, y)) -> 0
app'2(app'2(quot, app'2(s, x)), app'2(s, y)) -> app'2(s, app'2(app'2(quot, app'2(app'2(minus, x), y)), app'2(s, y)))
app'2(app'2(le, 0), y) -> true
app'2(app'2(le, app'2(s, x)), 0) -> false
app'2(app'2(le, app'2(s, x)), app'2(s, y)) -> app'2(app'2(le, x), y)
app'2(app'2(app, nil), y) -> y
app'2(app'2(app, app'2(app'2(add, n), x)), y) -> app'2(app'2(add, n), app'2(app'2(app, x), y))
app'2(app'2(low, n), nil) -> nil
app'2(app'2(low, n), app'2(app'2(add, m), x)) -> app'2(app'2(app'2(if_low, app'2(app'2(le, m), n)), n), app'2(app'2(add, m), x))
app'2(app'2(app'2(if_low, true), n), app'2(app'2(add, m), x)) -> app'2(app'2(add, m), app'2(app'2(low, n), x))
app'2(app'2(app'2(if_low, false), n), app'2(app'2(add, m), x)) -> app'2(app'2(low, n), x)
app'2(app'2(high, n), nil) -> nil
app'2(app'2(high, n), app'2(app'2(add, m), x)) -> app'2(app'2(app'2(if_high, app'2(app'2(le, m), n)), n), app'2(app'2(add, m), x))
app'2(app'2(app'2(if_high, true), n), app'2(app'2(add, m), x)) -> app'2(app'2(high, n), x)
app'2(app'2(app'2(if_high, false), n), app'2(app'2(add, m), x)) -> app'2(app'2(add, m), app'2(app'2(high, n), x))
app'2(quicksort, nil) -> nil
app'2(quicksort, app'2(app'2(add, n), x)) -> app'2(app'2(app, app'2(quicksort, app'2(app'2(low, n), x))), app'2(app'2(add, n), app'2(quicksort, app'2(app'2(high, n), x))))
app'2(app'2(minus, x0), 0)
app'2(app'2(minus, app'2(s, x0)), app'2(s, x1))
app'2(app'2(quot, 0), app'2(s, x0))
app'2(app'2(quot, app'2(s, x0)), app'2(s, x1))
app'2(app'2(le, 0), x0)
app'2(app'2(le, app'2(s, x0)), 0)
app'2(app'2(le, app'2(s, x0)), app'2(s, x1))
app'2(app'2(app, nil), x0)
app'2(app'2(app, app'2(app'2(add, x0), x1)), x2)
app'2(app'2(low, x0), nil)
app'2(app'2(low, x0), app'2(app'2(add, x1), x2))
app'2(app'2(app'2(if_low, true), x0), app'2(app'2(add, x1), x2))
app'2(app'2(app'2(if_low, false), x0), app'2(app'2(add, x1), x2))
app'2(app'2(high, x0), nil)
app'2(app'2(high, x0), app'2(app'2(add, x1), x2))
app'2(app'2(app'2(if_high, true), x0), app'2(app'2(add, x1), x2))
app'2(app'2(app'2(if_high, false), x0), app'2(app'2(add, x1), x2))
app'2(quicksort, nil)
app'2(quicksort, app'2(app'2(add, x0), x1))
↳ QTRS
↳ Non-Overlap Check
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDPOrderProof
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
APP'2(app'2(le, app'2(s, x)), app'2(s, y)) -> APP'2(app'2(le, x), y)
app'2(app'2(minus, x), 0) -> x
app'2(app'2(minus, app'2(s, x)), app'2(s, y)) -> app'2(app'2(minus, x), y)
app'2(app'2(quot, 0), app'2(s, y)) -> 0
app'2(app'2(quot, app'2(s, x)), app'2(s, y)) -> app'2(s, app'2(app'2(quot, app'2(app'2(minus, x), y)), app'2(s, y)))
app'2(app'2(le, 0), y) -> true
app'2(app'2(le, app'2(s, x)), 0) -> false
app'2(app'2(le, app'2(s, x)), app'2(s, y)) -> app'2(app'2(le, x), y)
app'2(app'2(app, nil), y) -> y
app'2(app'2(app, app'2(app'2(add, n), x)), y) -> app'2(app'2(add, n), app'2(app'2(app, x), y))
app'2(app'2(low, n), nil) -> nil
app'2(app'2(low, n), app'2(app'2(add, m), x)) -> app'2(app'2(app'2(if_low, app'2(app'2(le, m), n)), n), app'2(app'2(add, m), x))
app'2(app'2(app'2(if_low, true), n), app'2(app'2(add, m), x)) -> app'2(app'2(add, m), app'2(app'2(low, n), x))
app'2(app'2(app'2(if_low, false), n), app'2(app'2(add, m), x)) -> app'2(app'2(low, n), x)
app'2(app'2(high, n), nil) -> nil
app'2(app'2(high, n), app'2(app'2(add, m), x)) -> app'2(app'2(app'2(if_high, app'2(app'2(le, m), n)), n), app'2(app'2(add, m), x))
app'2(app'2(app'2(if_high, true), n), app'2(app'2(add, m), x)) -> app'2(app'2(high, n), x)
app'2(app'2(app'2(if_high, false), n), app'2(app'2(add, m), x)) -> app'2(app'2(add, m), app'2(app'2(high, n), x))
app'2(quicksort, nil) -> nil
app'2(quicksort, app'2(app'2(add, n), x)) -> app'2(app'2(app, app'2(quicksort, app'2(app'2(low, n), x))), app'2(app'2(add, n), app'2(quicksort, app'2(app'2(high, n), x))))
app'2(app'2(minus, x0), 0)
app'2(app'2(minus, app'2(s, x0)), app'2(s, x1))
app'2(app'2(quot, 0), app'2(s, x0))
app'2(app'2(quot, app'2(s, x0)), app'2(s, x1))
app'2(app'2(le, 0), x0)
app'2(app'2(le, app'2(s, x0)), 0)
app'2(app'2(le, app'2(s, x0)), app'2(s, x1))
app'2(app'2(app, nil), x0)
app'2(app'2(app, app'2(app'2(add, x0), x1)), x2)
app'2(app'2(low, x0), nil)
app'2(app'2(low, x0), app'2(app'2(add, x1), x2))
app'2(app'2(app'2(if_low, true), x0), app'2(app'2(add, x1), x2))
app'2(app'2(app'2(if_low, false), x0), app'2(app'2(add, x1), x2))
app'2(app'2(high, x0), nil)
app'2(app'2(high, x0), app'2(app'2(add, x1), x2))
app'2(app'2(app'2(if_high, true), x0), app'2(app'2(add, x1), x2))
app'2(app'2(app'2(if_high, false), x0), app'2(app'2(add, x1), x2))
app'2(quicksort, nil)
app'2(quicksort, app'2(app'2(add, x0), x1))
The following pairs can be strictly oriented and are deleted.
The remaining pairs can at least by weakly be oriented.
APP'2(app'2(le, app'2(s, x)), app'2(s, y)) -> APP'2(app'2(le, x), y)
APP'1 > app'1
APP'1 > le
s > app'1
s > le
↳ QTRS
↳ Non-Overlap Check
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDPOrderProof
↳ QDP
↳ PisEmptyProof
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
app'2(app'2(minus, x), 0) -> x
app'2(app'2(minus, app'2(s, x)), app'2(s, y)) -> app'2(app'2(minus, x), y)
app'2(app'2(quot, 0), app'2(s, y)) -> 0
app'2(app'2(quot, app'2(s, x)), app'2(s, y)) -> app'2(s, app'2(app'2(quot, app'2(app'2(minus, x), y)), app'2(s, y)))
app'2(app'2(le, 0), y) -> true
app'2(app'2(le, app'2(s, x)), 0) -> false
app'2(app'2(le, app'2(s, x)), app'2(s, y)) -> app'2(app'2(le, x), y)
app'2(app'2(app, nil), y) -> y
app'2(app'2(app, app'2(app'2(add, n), x)), y) -> app'2(app'2(add, n), app'2(app'2(app, x), y))
app'2(app'2(low, n), nil) -> nil
app'2(app'2(low, n), app'2(app'2(add, m), x)) -> app'2(app'2(app'2(if_low, app'2(app'2(le, m), n)), n), app'2(app'2(add, m), x))
app'2(app'2(app'2(if_low, true), n), app'2(app'2(add, m), x)) -> app'2(app'2(add, m), app'2(app'2(low, n), x))
app'2(app'2(app'2(if_low, false), n), app'2(app'2(add, m), x)) -> app'2(app'2(low, n), x)
app'2(app'2(high, n), nil) -> nil
app'2(app'2(high, n), app'2(app'2(add, m), x)) -> app'2(app'2(app'2(if_high, app'2(app'2(le, m), n)), n), app'2(app'2(add, m), x))
app'2(app'2(app'2(if_high, true), n), app'2(app'2(add, m), x)) -> app'2(app'2(high, n), x)
app'2(app'2(app'2(if_high, false), n), app'2(app'2(add, m), x)) -> app'2(app'2(add, m), app'2(app'2(high, n), x))
app'2(quicksort, nil) -> nil
app'2(quicksort, app'2(app'2(add, n), x)) -> app'2(app'2(app, app'2(quicksort, app'2(app'2(low, n), x))), app'2(app'2(add, n), app'2(quicksort, app'2(app'2(high, n), x))))
app'2(app'2(minus, x0), 0)
app'2(app'2(minus, app'2(s, x0)), app'2(s, x1))
app'2(app'2(quot, 0), app'2(s, x0))
app'2(app'2(quot, app'2(s, x0)), app'2(s, x1))
app'2(app'2(le, 0), x0)
app'2(app'2(le, app'2(s, x0)), 0)
app'2(app'2(le, app'2(s, x0)), app'2(s, x1))
app'2(app'2(app, nil), x0)
app'2(app'2(app, app'2(app'2(add, x0), x1)), x2)
app'2(app'2(low, x0), nil)
app'2(app'2(low, x0), app'2(app'2(add, x1), x2))
app'2(app'2(app'2(if_low, true), x0), app'2(app'2(add, x1), x2))
app'2(app'2(app'2(if_low, false), x0), app'2(app'2(add, x1), x2))
app'2(app'2(high, x0), nil)
app'2(app'2(high, x0), app'2(app'2(add, x1), x2))
app'2(app'2(app'2(if_high, true), x0), app'2(app'2(add, x1), x2))
app'2(app'2(app'2(if_high, false), x0), app'2(app'2(add, x1), x2))
app'2(quicksort, nil)
app'2(quicksort, app'2(app'2(add, x0), x1))
↳ QTRS
↳ Non-Overlap Check
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDPOrderProof
↳ QDP
↳ QDP
↳ QDP
↳ QDP
APP'2(app'2(high, n), app'2(app'2(add, m), x)) -> APP'2(app'2(app'2(if_high, app'2(app'2(le, m), n)), n), app'2(app'2(add, m), x))
APP'2(app'2(app'2(if_high, false), n), app'2(app'2(add, m), x)) -> APP'2(app'2(high, n), x)
APP'2(app'2(app'2(if_high, true), n), app'2(app'2(add, m), x)) -> APP'2(app'2(high, n), x)
app'2(app'2(minus, x), 0) -> x
app'2(app'2(minus, app'2(s, x)), app'2(s, y)) -> app'2(app'2(minus, x), y)
app'2(app'2(quot, 0), app'2(s, y)) -> 0
app'2(app'2(quot, app'2(s, x)), app'2(s, y)) -> app'2(s, app'2(app'2(quot, app'2(app'2(minus, x), y)), app'2(s, y)))
app'2(app'2(le, 0), y) -> true
app'2(app'2(le, app'2(s, x)), 0) -> false
app'2(app'2(le, app'2(s, x)), app'2(s, y)) -> app'2(app'2(le, x), y)
app'2(app'2(app, nil), y) -> y
app'2(app'2(app, app'2(app'2(add, n), x)), y) -> app'2(app'2(add, n), app'2(app'2(app, x), y))
app'2(app'2(low, n), nil) -> nil
app'2(app'2(low, n), app'2(app'2(add, m), x)) -> app'2(app'2(app'2(if_low, app'2(app'2(le, m), n)), n), app'2(app'2(add, m), x))
app'2(app'2(app'2(if_low, true), n), app'2(app'2(add, m), x)) -> app'2(app'2(add, m), app'2(app'2(low, n), x))
app'2(app'2(app'2(if_low, false), n), app'2(app'2(add, m), x)) -> app'2(app'2(low, n), x)
app'2(app'2(high, n), nil) -> nil
app'2(app'2(high, n), app'2(app'2(add, m), x)) -> app'2(app'2(app'2(if_high, app'2(app'2(le, m), n)), n), app'2(app'2(add, m), x))
app'2(app'2(app'2(if_high, true), n), app'2(app'2(add, m), x)) -> app'2(app'2(high, n), x)
app'2(app'2(app'2(if_high, false), n), app'2(app'2(add, m), x)) -> app'2(app'2(add, m), app'2(app'2(high, n), x))
app'2(quicksort, nil) -> nil
app'2(quicksort, app'2(app'2(add, n), x)) -> app'2(app'2(app, app'2(quicksort, app'2(app'2(low, n), x))), app'2(app'2(add, n), app'2(quicksort, app'2(app'2(high, n), x))))
app'2(app'2(minus, x0), 0)
app'2(app'2(minus, app'2(s, x0)), app'2(s, x1))
app'2(app'2(quot, 0), app'2(s, x0))
app'2(app'2(quot, app'2(s, x0)), app'2(s, x1))
app'2(app'2(le, 0), x0)
app'2(app'2(le, app'2(s, x0)), 0)
app'2(app'2(le, app'2(s, x0)), app'2(s, x1))
app'2(app'2(app, nil), x0)
app'2(app'2(app, app'2(app'2(add, x0), x1)), x2)
app'2(app'2(low, x0), nil)
app'2(app'2(low, x0), app'2(app'2(add, x1), x2))
app'2(app'2(app'2(if_low, true), x0), app'2(app'2(add, x1), x2))
app'2(app'2(app'2(if_low, false), x0), app'2(app'2(add, x1), x2))
app'2(app'2(high, x0), nil)
app'2(app'2(high, x0), app'2(app'2(add, x1), x2))
app'2(app'2(app'2(if_high, true), x0), app'2(app'2(add, x1), x2))
app'2(app'2(app'2(if_high, false), x0), app'2(app'2(add, x1), x2))
app'2(quicksort, nil)
app'2(quicksort, app'2(app'2(add, x0), x1))
The following pairs can be strictly oriented and are deleted.
The remaining pairs can at least by weakly be oriented.
APP'2(app'2(app'2(if_high, false), n), app'2(app'2(add, m), x)) -> APP'2(app'2(high, n), x)
APP'2(app'2(app'2(if_high, true), n), app'2(app'2(add, m), x)) -> APP'2(app'2(high, n), x)
Used ordering: Combined order from the following AFS and order.
APP'2(app'2(high, n), app'2(app'2(add, m), x)) -> APP'2(app'2(app'2(if_high, app'2(app'2(le, m), n)), n), app'2(app'2(add, m), x))
ifhigh > high > APP'1 > add > true
ifhigh > high > app'1 > true
le > false > true
0 > false > true
s > true
app'2(app'2(le, 0), y) -> true
app'2(app'2(le, app'2(s, x)), 0) -> false
app'2(app'2(le, app'2(s, x)), app'2(s, y)) -> app'2(app'2(le, x), y)
↳ QTRS
↳ Non-Overlap Check
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDPOrderProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ QDP
↳ QDP
↳ QDP
APP'2(app'2(high, n), app'2(app'2(add, m), x)) -> APP'2(app'2(app'2(if_high, app'2(app'2(le, m), n)), n), app'2(app'2(add, m), x))
app'2(app'2(minus, x), 0) -> x
app'2(app'2(minus, app'2(s, x)), app'2(s, y)) -> app'2(app'2(minus, x), y)
app'2(app'2(quot, 0), app'2(s, y)) -> 0
app'2(app'2(quot, app'2(s, x)), app'2(s, y)) -> app'2(s, app'2(app'2(quot, app'2(app'2(minus, x), y)), app'2(s, y)))
app'2(app'2(le, 0), y) -> true
app'2(app'2(le, app'2(s, x)), 0) -> false
app'2(app'2(le, app'2(s, x)), app'2(s, y)) -> app'2(app'2(le, x), y)
app'2(app'2(app, nil), y) -> y
app'2(app'2(app, app'2(app'2(add, n), x)), y) -> app'2(app'2(add, n), app'2(app'2(app, x), y))
app'2(app'2(low, n), nil) -> nil
app'2(app'2(low, n), app'2(app'2(add, m), x)) -> app'2(app'2(app'2(if_low, app'2(app'2(le, m), n)), n), app'2(app'2(add, m), x))
app'2(app'2(app'2(if_low, true), n), app'2(app'2(add, m), x)) -> app'2(app'2(add, m), app'2(app'2(low, n), x))
app'2(app'2(app'2(if_low, false), n), app'2(app'2(add, m), x)) -> app'2(app'2(low, n), x)
app'2(app'2(high, n), nil) -> nil
app'2(app'2(high, n), app'2(app'2(add, m), x)) -> app'2(app'2(app'2(if_high, app'2(app'2(le, m), n)), n), app'2(app'2(add, m), x))
app'2(app'2(app'2(if_high, true), n), app'2(app'2(add, m), x)) -> app'2(app'2(high, n), x)
app'2(app'2(app'2(if_high, false), n), app'2(app'2(add, m), x)) -> app'2(app'2(add, m), app'2(app'2(high, n), x))
app'2(quicksort, nil) -> nil
app'2(quicksort, app'2(app'2(add, n), x)) -> app'2(app'2(app, app'2(quicksort, app'2(app'2(low, n), x))), app'2(app'2(add, n), app'2(quicksort, app'2(app'2(high, n), x))))
app'2(app'2(minus, x0), 0)
app'2(app'2(minus, app'2(s, x0)), app'2(s, x1))
app'2(app'2(quot, 0), app'2(s, x0))
app'2(app'2(quot, app'2(s, x0)), app'2(s, x1))
app'2(app'2(le, 0), x0)
app'2(app'2(le, app'2(s, x0)), 0)
app'2(app'2(le, app'2(s, x0)), app'2(s, x1))
app'2(app'2(app, nil), x0)
app'2(app'2(app, app'2(app'2(add, x0), x1)), x2)
app'2(app'2(low, x0), nil)
app'2(app'2(low, x0), app'2(app'2(add, x1), x2))
app'2(app'2(app'2(if_low, true), x0), app'2(app'2(add, x1), x2))
app'2(app'2(app'2(if_low, false), x0), app'2(app'2(add, x1), x2))
app'2(app'2(high, x0), nil)
app'2(app'2(high, x0), app'2(app'2(add, x1), x2))
app'2(app'2(app'2(if_high, true), x0), app'2(app'2(add, x1), x2))
app'2(app'2(app'2(if_high, false), x0), app'2(app'2(add, x1), x2))
app'2(quicksort, nil)
app'2(quicksort, app'2(app'2(add, x0), x1))
↳ QTRS
↳ Non-Overlap Check
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDPOrderProof
↳ QDP
↳ QDP
↳ QDP
APP'2(app'2(app'2(if_low, true), n), app'2(app'2(add, m), x)) -> APP'2(app'2(low, n), x)
APP'2(app'2(app'2(if_low, false), n), app'2(app'2(add, m), x)) -> APP'2(app'2(low, n), x)
APP'2(app'2(low, n), app'2(app'2(add, m), x)) -> APP'2(app'2(app'2(if_low, app'2(app'2(le, m), n)), n), app'2(app'2(add, m), x))
app'2(app'2(minus, x), 0) -> x
app'2(app'2(minus, app'2(s, x)), app'2(s, y)) -> app'2(app'2(minus, x), y)
app'2(app'2(quot, 0), app'2(s, y)) -> 0
app'2(app'2(quot, app'2(s, x)), app'2(s, y)) -> app'2(s, app'2(app'2(quot, app'2(app'2(minus, x), y)), app'2(s, y)))
app'2(app'2(le, 0), y) -> true
app'2(app'2(le, app'2(s, x)), 0) -> false
app'2(app'2(le, app'2(s, x)), app'2(s, y)) -> app'2(app'2(le, x), y)
app'2(app'2(app, nil), y) -> y
app'2(app'2(app, app'2(app'2(add, n), x)), y) -> app'2(app'2(add, n), app'2(app'2(app, x), y))
app'2(app'2(low, n), nil) -> nil
app'2(app'2(low, n), app'2(app'2(add, m), x)) -> app'2(app'2(app'2(if_low, app'2(app'2(le, m), n)), n), app'2(app'2(add, m), x))
app'2(app'2(app'2(if_low, true), n), app'2(app'2(add, m), x)) -> app'2(app'2(add, m), app'2(app'2(low, n), x))
app'2(app'2(app'2(if_low, false), n), app'2(app'2(add, m), x)) -> app'2(app'2(low, n), x)
app'2(app'2(high, n), nil) -> nil
app'2(app'2(high, n), app'2(app'2(add, m), x)) -> app'2(app'2(app'2(if_high, app'2(app'2(le, m), n)), n), app'2(app'2(add, m), x))
app'2(app'2(app'2(if_high, true), n), app'2(app'2(add, m), x)) -> app'2(app'2(high, n), x)
app'2(app'2(app'2(if_high, false), n), app'2(app'2(add, m), x)) -> app'2(app'2(add, m), app'2(app'2(high, n), x))
app'2(quicksort, nil) -> nil
app'2(quicksort, app'2(app'2(add, n), x)) -> app'2(app'2(app, app'2(quicksort, app'2(app'2(low, n), x))), app'2(app'2(add, n), app'2(quicksort, app'2(app'2(high, n), x))))
app'2(app'2(minus, x0), 0)
app'2(app'2(minus, app'2(s, x0)), app'2(s, x1))
app'2(app'2(quot, 0), app'2(s, x0))
app'2(app'2(quot, app'2(s, x0)), app'2(s, x1))
app'2(app'2(le, 0), x0)
app'2(app'2(le, app'2(s, x0)), 0)
app'2(app'2(le, app'2(s, x0)), app'2(s, x1))
app'2(app'2(app, nil), x0)
app'2(app'2(app, app'2(app'2(add, x0), x1)), x2)
app'2(app'2(low, x0), nil)
app'2(app'2(low, x0), app'2(app'2(add, x1), x2))
app'2(app'2(app'2(if_low, true), x0), app'2(app'2(add, x1), x2))
app'2(app'2(app'2(if_low, false), x0), app'2(app'2(add, x1), x2))
app'2(app'2(high, x0), nil)
app'2(app'2(high, x0), app'2(app'2(add, x1), x2))
app'2(app'2(app'2(if_high, true), x0), app'2(app'2(add, x1), x2))
app'2(app'2(app'2(if_high, false), x0), app'2(app'2(add, x1), x2))
app'2(quicksort, nil)
app'2(quicksort, app'2(app'2(add, x0), x1))
The following pairs can be strictly oriented and are deleted.
The remaining pairs can at least by weakly be oriented.
APP'2(app'2(app'2(if_low, true), n), app'2(app'2(add, m), x)) -> APP'2(app'2(low, n), x)
APP'2(app'2(app'2(if_low, false), n), app'2(app'2(add, m), x)) -> APP'2(app'2(low, n), x)
Used ordering: Combined order from the following AFS and order.
APP'2(app'2(low, n), app'2(app'2(add, m), x)) -> APP'2(app'2(app'2(if_low, app'2(app'2(le, m), n)), n), app'2(app'2(add, m), x))
APP'2 > le > iflow
app'1 > true > iflow
app'1 > false > iflow
app'1 > le > iflow
add > le > iflow
low > le > iflow
0 > true > iflow
0 > false > iflow
s > false > iflow
s > le > iflow
app'2(app'2(le, 0), y) -> true
app'2(app'2(le, app'2(s, x)), 0) -> false
app'2(app'2(le, app'2(s, x)), app'2(s, y)) -> app'2(app'2(le, x), y)
↳ QTRS
↳ Non-Overlap Check
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDPOrderProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ QDP
↳ QDP
APP'2(app'2(low, n), app'2(app'2(add, m), x)) -> APP'2(app'2(app'2(if_low, app'2(app'2(le, m), n)), n), app'2(app'2(add, m), x))
app'2(app'2(minus, x), 0) -> x
app'2(app'2(minus, app'2(s, x)), app'2(s, y)) -> app'2(app'2(minus, x), y)
app'2(app'2(quot, 0), app'2(s, y)) -> 0
app'2(app'2(quot, app'2(s, x)), app'2(s, y)) -> app'2(s, app'2(app'2(quot, app'2(app'2(minus, x), y)), app'2(s, y)))
app'2(app'2(le, 0), y) -> true
app'2(app'2(le, app'2(s, x)), 0) -> false
app'2(app'2(le, app'2(s, x)), app'2(s, y)) -> app'2(app'2(le, x), y)
app'2(app'2(app, nil), y) -> y
app'2(app'2(app, app'2(app'2(add, n), x)), y) -> app'2(app'2(add, n), app'2(app'2(app, x), y))
app'2(app'2(low, n), nil) -> nil
app'2(app'2(low, n), app'2(app'2(add, m), x)) -> app'2(app'2(app'2(if_low, app'2(app'2(le, m), n)), n), app'2(app'2(add, m), x))
app'2(app'2(app'2(if_low, true), n), app'2(app'2(add, m), x)) -> app'2(app'2(add, m), app'2(app'2(low, n), x))
app'2(app'2(app'2(if_low, false), n), app'2(app'2(add, m), x)) -> app'2(app'2(low, n), x)
app'2(app'2(high, n), nil) -> nil
app'2(app'2(high, n), app'2(app'2(add, m), x)) -> app'2(app'2(app'2(if_high, app'2(app'2(le, m), n)), n), app'2(app'2(add, m), x))
app'2(app'2(app'2(if_high, true), n), app'2(app'2(add, m), x)) -> app'2(app'2(high, n), x)
app'2(app'2(app'2(if_high, false), n), app'2(app'2(add, m), x)) -> app'2(app'2(add, m), app'2(app'2(high, n), x))
app'2(quicksort, nil) -> nil
app'2(quicksort, app'2(app'2(add, n), x)) -> app'2(app'2(app, app'2(quicksort, app'2(app'2(low, n), x))), app'2(app'2(add, n), app'2(quicksort, app'2(app'2(high, n), x))))
app'2(app'2(minus, x0), 0)
app'2(app'2(minus, app'2(s, x0)), app'2(s, x1))
app'2(app'2(quot, 0), app'2(s, x0))
app'2(app'2(quot, app'2(s, x0)), app'2(s, x1))
app'2(app'2(le, 0), x0)
app'2(app'2(le, app'2(s, x0)), 0)
app'2(app'2(le, app'2(s, x0)), app'2(s, x1))
app'2(app'2(app, nil), x0)
app'2(app'2(app, app'2(app'2(add, x0), x1)), x2)
app'2(app'2(low, x0), nil)
app'2(app'2(low, x0), app'2(app'2(add, x1), x2))
app'2(app'2(app'2(if_low, true), x0), app'2(app'2(add, x1), x2))
app'2(app'2(app'2(if_low, false), x0), app'2(app'2(add, x1), x2))
app'2(app'2(high, x0), nil)
app'2(app'2(high, x0), app'2(app'2(add, x1), x2))
app'2(app'2(app'2(if_high, true), x0), app'2(app'2(add, x1), x2))
app'2(app'2(app'2(if_high, false), x0), app'2(app'2(add, x1), x2))
app'2(quicksort, nil)
app'2(quicksort, app'2(app'2(add, x0), x1))
↳ QTRS
↳ Non-Overlap Check
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
APP'2(quicksort, app'2(app'2(add, n), x)) -> APP'2(quicksort, app'2(app'2(high, n), x))
APP'2(quicksort, app'2(app'2(add, n), x)) -> APP'2(quicksort, app'2(app'2(low, n), x))
app'2(app'2(minus, x), 0) -> x
app'2(app'2(minus, app'2(s, x)), app'2(s, y)) -> app'2(app'2(minus, x), y)
app'2(app'2(quot, 0), app'2(s, y)) -> 0
app'2(app'2(quot, app'2(s, x)), app'2(s, y)) -> app'2(s, app'2(app'2(quot, app'2(app'2(minus, x), y)), app'2(s, y)))
app'2(app'2(le, 0), y) -> true
app'2(app'2(le, app'2(s, x)), 0) -> false
app'2(app'2(le, app'2(s, x)), app'2(s, y)) -> app'2(app'2(le, x), y)
app'2(app'2(app, nil), y) -> y
app'2(app'2(app, app'2(app'2(add, n), x)), y) -> app'2(app'2(add, n), app'2(app'2(app, x), y))
app'2(app'2(low, n), nil) -> nil
app'2(app'2(low, n), app'2(app'2(add, m), x)) -> app'2(app'2(app'2(if_low, app'2(app'2(le, m), n)), n), app'2(app'2(add, m), x))
app'2(app'2(app'2(if_low, true), n), app'2(app'2(add, m), x)) -> app'2(app'2(add, m), app'2(app'2(low, n), x))
app'2(app'2(app'2(if_low, false), n), app'2(app'2(add, m), x)) -> app'2(app'2(low, n), x)
app'2(app'2(high, n), nil) -> nil
app'2(app'2(high, n), app'2(app'2(add, m), x)) -> app'2(app'2(app'2(if_high, app'2(app'2(le, m), n)), n), app'2(app'2(add, m), x))
app'2(app'2(app'2(if_high, true), n), app'2(app'2(add, m), x)) -> app'2(app'2(high, n), x)
app'2(app'2(app'2(if_high, false), n), app'2(app'2(add, m), x)) -> app'2(app'2(add, m), app'2(app'2(high, n), x))
app'2(quicksort, nil) -> nil
app'2(quicksort, app'2(app'2(add, n), x)) -> app'2(app'2(app, app'2(quicksort, app'2(app'2(low, n), x))), app'2(app'2(add, n), app'2(quicksort, app'2(app'2(high, n), x))))
app'2(app'2(minus, x0), 0)
app'2(app'2(minus, app'2(s, x0)), app'2(s, x1))
app'2(app'2(quot, 0), app'2(s, x0))
app'2(app'2(quot, app'2(s, x0)), app'2(s, x1))
app'2(app'2(le, 0), x0)
app'2(app'2(le, app'2(s, x0)), 0)
app'2(app'2(le, app'2(s, x0)), app'2(s, x1))
app'2(app'2(app, nil), x0)
app'2(app'2(app, app'2(app'2(add, x0), x1)), x2)
app'2(app'2(low, x0), nil)
app'2(app'2(low, x0), app'2(app'2(add, x1), x2))
app'2(app'2(app'2(if_low, true), x0), app'2(app'2(add, x1), x2))
app'2(app'2(app'2(if_low, false), x0), app'2(app'2(add, x1), x2))
app'2(app'2(high, x0), nil)
app'2(app'2(high, x0), app'2(app'2(add, x1), x2))
app'2(app'2(app'2(if_high, true), x0), app'2(app'2(add, x1), x2))
app'2(app'2(app'2(if_high, false), x0), app'2(app'2(add, x1), x2))
app'2(quicksort, nil)
app'2(quicksort, app'2(app'2(add, x0), x1))
↳ QTRS
↳ Non-Overlap Check
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDPOrderProof
↳ QDP
APP'2(app'2(minus, app'2(s, x)), app'2(s, y)) -> APP'2(app'2(minus, x), y)
app'2(app'2(minus, x), 0) -> x
app'2(app'2(minus, app'2(s, x)), app'2(s, y)) -> app'2(app'2(minus, x), y)
app'2(app'2(quot, 0), app'2(s, y)) -> 0
app'2(app'2(quot, app'2(s, x)), app'2(s, y)) -> app'2(s, app'2(app'2(quot, app'2(app'2(minus, x), y)), app'2(s, y)))
app'2(app'2(le, 0), y) -> true
app'2(app'2(le, app'2(s, x)), 0) -> false
app'2(app'2(le, app'2(s, x)), app'2(s, y)) -> app'2(app'2(le, x), y)
app'2(app'2(app, nil), y) -> y
app'2(app'2(app, app'2(app'2(add, n), x)), y) -> app'2(app'2(add, n), app'2(app'2(app, x), y))
app'2(app'2(low, n), nil) -> nil
app'2(app'2(low, n), app'2(app'2(add, m), x)) -> app'2(app'2(app'2(if_low, app'2(app'2(le, m), n)), n), app'2(app'2(add, m), x))
app'2(app'2(app'2(if_low, true), n), app'2(app'2(add, m), x)) -> app'2(app'2(add, m), app'2(app'2(low, n), x))
app'2(app'2(app'2(if_low, false), n), app'2(app'2(add, m), x)) -> app'2(app'2(low, n), x)
app'2(app'2(high, n), nil) -> nil
app'2(app'2(high, n), app'2(app'2(add, m), x)) -> app'2(app'2(app'2(if_high, app'2(app'2(le, m), n)), n), app'2(app'2(add, m), x))
app'2(app'2(app'2(if_high, true), n), app'2(app'2(add, m), x)) -> app'2(app'2(high, n), x)
app'2(app'2(app'2(if_high, false), n), app'2(app'2(add, m), x)) -> app'2(app'2(add, m), app'2(app'2(high, n), x))
app'2(quicksort, nil) -> nil
app'2(quicksort, app'2(app'2(add, n), x)) -> app'2(app'2(app, app'2(quicksort, app'2(app'2(low, n), x))), app'2(app'2(add, n), app'2(quicksort, app'2(app'2(high, n), x))))
app'2(app'2(minus, x0), 0)
app'2(app'2(minus, app'2(s, x0)), app'2(s, x1))
app'2(app'2(quot, 0), app'2(s, x0))
app'2(app'2(quot, app'2(s, x0)), app'2(s, x1))
app'2(app'2(le, 0), x0)
app'2(app'2(le, app'2(s, x0)), 0)
app'2(app'2(le, app'2(s, x0)), app'2(s, x1))
app'2(app'2(app, nil), x0)
app'2(app'2(app, app'2(app'2(add, x0), x1)), x2)
app'2(app'2(low, x0), nil)
app'2(app'2(low, x0), app'2(app'2(add, x1), x2))
app'2(app'2(app'2(if_low, true), x0), app'2(app'2(add, x1), x2))
app'2(app'2(app'2(if_low, false), x0), app'2(app'2(add, x1), x2))
app'2(app'2(high, x0), nil)
app'2(app'2(high, x0), app'2(app'2(add, x1), x2))
app'2(app'2(app'2(if_high, true), x0), app'2(app'2(add, x1), x2))
app'2(app'2(app'2(if_high, false), x0), app'2(app'2(add, x1), x2))
app'2(quicksort, nil)
app'2(quicksort, app'2(app'2(add, x0), x1))
The following pairs can be strictly oriented and are deleted.
The remaining pairs can at least by weakly be oriented.
APP'2(app'2(minus, app'2(s, x)), app'2(s, y)) -> APP'2(app'2(minus, x), y)
APP'1 > app'1
APP'1 > minus
s > app'1
s > minus
↳ QTRS
↳ Non-Overlap Check
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDPOrderProof
↳ QDP
↳ PisEmptyProof
↳ QDP
app'2(app'2(minus, x), 0) -> x
app'2(app'2(minus, app'2(s, x)), app'2(s, y)) -> app'2(app'2(minus, x), y)
app'2(app'2(quot, 0), app'2(s, y)) -> 0
app'2(app'2(quot, app'2(s, x)), app'2(s, y)) -> app'2(s, app'2(app'2(quot, app'2(app'2(minus, x), y)), app'2(s, y)))
app'2(app'2(le, 0), y) -> true
app'2(app'2(le, app'2(s, x)), 0) -> false
app'2(app'2(le, app'2(s, x)), app'2(s, y)) -> app'2(app'2(le, x), y)
app'2(app'2(app, nil), y) -> y
app'2(app'2(app, app'2(app'2(add, n), x)), y) -> app'2(app'2(add, n), app'2(app'2(app, x), y))
app'2(app'2(low, n), nil) -> nil
app'2(app'2(low, n), app'2(app'2(add, m), x)) -> app'2(app'2(app'2(if_low, app'2(app'2(le, m), n)), n), app'2(app'2(add, m), x))
app'2(app'2(app'2(if_low, true), n), app'2(app'2(add, m), x)) -> app'2(app'2(add, m), app'2(app'2(low, n), x))
app'2(app'2(app'2(if_low, false), n), app'2(app'2(add, m), x)) -> app'2(app'2(low, n), x)
app'2(app'2(high, n), nil) -> nil
app'2(app'2(high, n), app'2(app'2(add, m), x)) -> app'2(app'2(app'2(if_high, app'2(app'2(le, m), n)), n), app'2(app'2(add, m), x))
app'2(app'2(app'2(if_high, true), n), app'2(app'2(add, m), x)) -> app'2(app'2(high, n), x)
app'2(app'2(app'2(if_high, false), n), app'2(app'2(add, m), x)) -> app'2(app'2(add, m), app'2(app'2(high, n), x))
app'2(quicksort, nil) -> nil
app'2(quicksort, app'2(app'2(add, n), x)) -> app'2(app'2(app, app'2(quicksort, app'2(app'2(low, n), x))), app'2(app'2(add, n), app'2(quicksort, app'2(app'2(high, n), x))))
app'2(app'2(minus, x0), 0)
app'2(app'2(minus, app'2(s, x0)), app'2(s, x1))
app'2(app'2(quot, 0), app'2(s, x0))
app'2(app'2(quot, app'2(s, x0)), app'2(s, x1))
app'2(app'2(le, 0), x0)
app'2(app'2(le, app'2(s, x0)), 0)
app'2(app'2(le, app'2(s, x0)), app'2(s, x1))
app'2(app'2(app, nil), x0)
app'2(app'2(app, app'2(app'2(add, x0), x1)), x2)
app'2(app'2(low, x0), nil)
app'2(app'2(low, x0), app'2(app'2(add, x1), x2))
app'2(app'2(app'2(if_low, true), x0), app'2(app'2(add, x1), x2))
app'2(app'2(app'2(if_low, false), x0), app'2(app'2(add, x1), x2))
app'2(app'2(high, x0), nil)
app'2(app'2(high, x0), app'2(app'2(add, x1), x2))
app'2(app'2(app'2(if_high, true), x0), app'2(app'2(add, x1), x2))
app'2(app'2(app'2(if_high, false), x0), app'2(app'2(add, x1), x2))
app'2(quicksort, nil)
app'2(quicksort, app'2(app'2(add, x0), x1))
↳ QTRS
↳ Non-Overlap Check
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
APP'2(app'2(quot, app'2(s, x)), app'2(s, y)) -> APP'2(app'2(quot, app'2(app'2(minus, x), y)), app'2(s, y))
app'2(app'2(minus, x), 0) -> x
app'2(app'2(minus, app'2(s, x)), app'2(s, y)) -> app'2(app'2(minus, x), y)
app'2(app'2(quot, 0), app'2(s, y)) -> 0
app'2(app'2(quot, app'2(s, x)), app'2(s, y)) -> app'2(s, app'2(app'2(quot, app'2(app'2(minus, x), y)), app'2(s, y)))
app'2(app'2(le, 0), y) -> true
app'2(app'2(le, app'2(s, x)), 0) -> false
app'2(app'2(le, app'2(s, x)), app'2(s, y)) -> app'2(app'2(le, x), y)
app'2(app'2(app, nil), y) -> y
app'2(app'2(app, app'2(app'2(add, n), x)), y) -> app'2(app'2(add, n), app'2(app'2(app, x), y))
app'2(app'2(low, n), nil) -> nil
app'2(app'2(low, n), app'2(app'2(add, m), x)) -> app'2(app'2(app'2(if_low, app'2(app'2(le, m), n)), n), app'2(app'2(add, m), x))
app'2(app'2(app'2(if_low, true), n), app'2(app'2(add, m), x)) -> app'2(app'2(add, m), app'2(app'2(low, n), x))
app'2(app'2(app'2(if_low, false), n), app'2(app'2(add, m), x)) -> app'2(app'2(low, n), x)
app'2(app'2(high, n), nil) -> nil
app'2(app'2(high, n), app'2(app'2(add, m), x)) -> app'2(app'2(app'2(if_high, app'2(app'2(le, m), n)), n), app'2(app'2(add, m), x))
app'2(app'2(app'2(if_high, true), n), app'2(app'2(add, m), x)) -> app'2(app'2(high, n), x)
app'2(app'2(app'2(if_high, false), n), app'2(app'2(add, m), x)) -> app'2(app'2(add, m), app'2(app'2(high, n), x))
app'2(quicksort, nil) -> nil
app'2(quicksort, app'2(app'2(add, n), x)) -> app'2(app'2(app, app'2(quicksort, app'2(app'2(low, n), x))), app'2(app'2(add, n), app'2(quicksort, app'2(app'2(high, n), x))))
app'2(app'2(minus, x0), 0)
app'2(app'2(minus, app'2(s, x0)), app'2(s, x1))
app'2(app'2(quot, 0), app'2(s, x0))
app'2(app'2(quot, app'2(s, x0)), app'2(s, x1))
app'2(app'2(le, 0), x0)
app'2(app'2(le, app'2(s, x0)), 0)
app'2(app'2(le, app'2(s, x0)), app'2(s, x1))
app'2(app'2(app, nil), x0)
app'2(app'2(app, app'2(app'2(add, x0), x1)), x2)
app'2(app'2(low, x0), nil)
app'2(app'2(low, x0), app'2(app'2(add, x1), x2))
app'2(app'2(app'2(if_low, true), x0), app'2(app'2(add, x1), x2))
app'2(app'2(app'2(if_low, false), x0), app'2(app'2(add, x1), x2))
app'2(app'2(high, x0), nil)
app'2(app'2(high, x0), app'2(app'2(add, x1), x2))
app'2(app'2(app'2(if_high, true), x0), app'2(app'2(add, x1), x2))
app'2(app'2(app'2(if_high, false), x0), app'2(app'2(add, x1), x2))
app'2(quicksort, nil)
app'2(quicksort, app'2(app'2(add, x0), x1))